Jones Polynomials of Alternating Links
نویسنده
چکیده
Let Jk(*) = nrtr + • ■ • + asta, r > s, be the Jones polynomial of a knot if in S3. For an alternating knot, it is proved that r — s is bounded by the number of double points in any alternating projection of K. This upper bound is attained by many alternating knots, including 2-bridge knots, and therefore, for these knots, r — s gives the minimum number of double points among all alternating projections of K. If K is a special alternating knot, it is also proved that a3 = 1 and s is equal to the genus of K. Similar results hold for links.
منابع مشابه
Euclidean Mahler Measure and Twisted Links
If the twist numbers of a collection of oriented alternating link diagrams are bounded, then the Alexander polynomials of the corresponding links have bounded euclidean Mahler measure (see Definition 1.2). The converse assertion does not hold. Similarly, if a collection of oriented link diagrams, not necessarily alternating, have bounded twist numbers, then both the Jones polynomials and a para...
متن کاملOn links with cyclotomic Jones polynomials
We show that if {Ln} is any infinite sequence of links with twist number τ (Ln) and with cyclotomic Jones polynomials of increasing span, then lim sup τ (Ln) = ∞ . This implies that any infinite sequence of prime alternating links with cyclotomic Jones polynomials must have unbounded hyperbolic volume. The main tool is the multivariable twist–bracket polynomial, which generalizes the Kauffman b...
متن کاملSlopes and Colored Jones Polynomials of Adequate Links
Garoufalidis conjectured a relation between the boundary slopes of a knot and its colored Jones polynomials. More precisely, certain boundary slopes are detected by the sequence of degrees of the colored Jones polynomials. We verify this conjecture for adequate knots, a class that vastly generalizes that of alternating knots.
متن کاملZeros of Jones Polynomials for Families of Knots and Links
We calculate Jones polynomials VL(t) for several families of alternating knots and links by computing the Tutte polynomials T (G, x, y) for the associated graphs G and then obtaining VL(t) as a special case of the Tutte polynomial. For each of these families we determine the zeros of the Jones polynomial, including the accumulation set in the limit of infinitely many crossings. A discussion is ...
متن کاملColored Tutte Polynomials and Kauuman Brackets for Graphs of Bounded Tree Width
Jones polynomials and Kauuman polynomials are the most prominent invariants of knot theory. For alternating links, they are easily computable from the Tutte polynomials by a result of Thistlethwaite (1988), but in general one needs colored Tutte polynomials, as introduced by Bollobas and Riordan (1999). Knots and links can be presented as labeled planar graphs. The tree width of a link L is dee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010